Pii: S0010-4485(00)00059-2
نویسندگان
چکیده
We fair and ®t planar point sets by minimal-energy arc splines. The fairing process consists of two steps: computing the optimal tangents for curve interpolation and adjusting the point positions by smoothing the discrete curvatures. To ®t the point set with minimal-energy arc curve, a simple linear algorithm is given for computing the optimal tangents. The discrete curvatures derived from the optimal tangents can be made smooth by low-pass ®ltering. These two linear and local algorithms are combined to generate a fair point set together with a fair G arc curve within a given tolerance of the original data. The method can be used for fair shape design and measured data processing. Numerical examples are given to show the ef®ciency of this method. q 2000 Elsevier Science Ltd. All rights reserved.
منابع مشابه
Distributed maintenance of multiple product views
We present three mechanisms for maintaining consistent product views in a distributed product information data base. The mechanisms are used when one of the views makes a change to the product model and the other views must be updated to maintain consistency.
متن کاملPii: S0010-4485(00)00073-7
In variational CAD design, parametric models may fail to regenerate raising the question of which parameter values lead to valid models. The problem is easy to state but dif®cult to solve. Using a simpli®cation, we present an algorithm that computes for parametric models valid parameter ranges within which the model will regenerate. We explain also why the general problem is hard. q 2000 Elsevi...
متن کاملHex-dominant mesh generation using 3D constrained triangulation
A method for decomposing a volume with a prescribed quadrilateral surface mesh, into a hexahedral-dominated mesh is proposed. With this method, known as Hex-kforphing (HMorph), an initial tetrahedral mesh is provided. Tetrahedral are transformed and combined starting from the boundary and working towards the interior of the volume. The quadrilateral faces of the hexahedra are treated as interna...
متن کاملModel simplification for meshing using face clustering
In this work a new method for CAD model simpliication is presented. The method is especially suited for simpliications performed in preparation for meshing the models. It uses a local analysis approach based on a clustering procedure. The method provides a generic approach for model simpliication. It is eecient and robust. It works on non-manifold models, free-form and linear faces, and models ...
متن کاملOn swept volume formulations: implicit surfaces
Recent developments in formulations for generating swept volumes have made a significant impact on the efficiency of employing such algorithms and on the extent to which formulations can be used in representing complex shapes. In this paper, we outline a method for employing the representation of implicit surfaces using the Jacobian rank deficiency condition presented earlier for the sweep of p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000